Approximating partition functions of the two-state spin system
نویسندگان
چکیده
منابع مشابه
Approximating partition functions of the two-state spin system
Article history: Received 10 April 2010 Received in revised form 26 April 2011 Accepted 26 April 2011 Available online 29 April 2011 Communicated by A. Tarlecki
متن کاملApproximating Partition Functions of Two-State Spin Systems
Two-state spin systems is a classical topic in statistical physics. We consider the problem of computing the partition function of the systems on a bounded degree graph. Based on the self-avoiding tree, we prove the systems exhibits strong correlation decay under the condition that the absolute value of “inverse temperature” is small. Due to strong correlation decay property, an FPTAS for the p...
متن کاملApproximating the partition function of planar two-state spin systems
We consider the problem of approximating the partition function of the hard-core model on planar graphs of degree at most 4. We show that when the activity λ is sufficiently large, there is no fully polynomial randomised approximation scheme for evaluating the partition function unless NP = RP. The result extends to a nearby region of the parameter space in a more general two-state spin system ...
متن کاملStrong Spatial Mixing and Approximating Partition Functions of Two-State Spin Systems without Hard Constrains
We prove Gibbs distribution of two-state spin systems(also known as binary Markov random fields) without hard constrains on a tree exhibits strong spatial mixing(also known as strong correlation decay), under the assumption that, for arbitrary ‘external field’, the absolute value of ‘inverse temperature’ is small, or the ‘external field’ is uniformly large or small. The first condition on ‘inve...
متن کاملApproximating Partition Functions in Constant Time
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for approximating the partition function are Markov Chain Monte Carlo and Variational Methods. An impressive body of work in mathematics, physics and theoretical compute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2011
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.04.012